An improved bound for the star discrepancy of sequences in the unit interval
نویسندگان
چکیده
It is known that there is a constant c > 0 such that for every sequence x1, x2, . . . in [0, 1) we have for the star discrepancy D ∗ N of the first N elements of the sequence that ND∗ N ≥ c · logN holds for infinitely many N . Let c∗ be the supremum of all such c with this property. We show c∗ > 0.065664679 . . ., thereby slightly improving the estimates known until now.
منابع مشابه
ACTA UNIVERSITATIS APULENSIS No 18/2009 ON G-DISCREPANCY AND MIXED MONTE CARLO AND QUASI-MONTE CARLO SEQUENCES
The G-star and the G-discrepancy are generalizations of the well known star and the extreme discrepancy; thereby G denotes a given continuous distribution function on the d-dimensional unit cube [0, 1]. We list and prove some results that describe the behavior of the G-star and the Gdiscrepancy in terms of the dimension d and the number of sample points N . Our main focus is on so-called mixed ...
متن کاملOn G-Discrepancy and Mixed Monte Carlo and Quasi-Monte Carlo Sequences
The G-star and the G-discrepancy are generalizations of the well known star and the extreme discrepancy; thereby G denotes a given continuous distribution function on the d-dimensional unit cube [0, 1]d. We list and prove some results that describe the behavior of the G-star and the G-discrepancy in terms of the dimension d and the number of sample points N . Our main focus is on so-called mixe...
متن کاملImprovements on the star discrepancy of (t,s)-sequences
The term low-discrepancy sequences is widely used to refer to s-dimensional sequences X satisfying the bound D∗(N,X) ≤ cs(logN) + O((logN)s−1), where D∗ denotes the usual star discrepancy. In this article, we are concerned with (t, s)-sequences in base b, one of the most famous families of low-discrepancy sequences along with Halton sequences. The constants cs for (t, s)-sequences were first co...
متن کاملAn improved approach for ranking the candidates in a voting system based on efficiency intervals
This paper proposes improvements and revisions to a recent approach in a voting system, and provides an effective approach with a stronger discriminate power. For this purpose, the advantage of a linear transformation is utilized to redene a previously used concept of virtual worst candidate, by incorporating the existing weight restrictions. Then, the best score of this virtual candidate is us...
متن کاملA New Upper Bound on the Star Discrepancy of (0,1)-sequences
We study (0, 1)-sequences in arbitrary base b and derive a new upper bound on the star discrepancy of these. Moreover, we show that the van der Corput sequence is the sequence with the highest star discrepancy among all (0, 1)-sequences. The key property of the van der Corput sequence leading to this result is that its points are in a certain sense as close to the origin as possible. The main t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015